Queues with Redundancy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm

This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...

متن کامل

Redundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies

To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...

متن کامل

Bin Packing with Queues

We study the best achievable performance (in terms of the average queue size and delay) in a stochastic and dynamic version of the bin-packing problem. Items arrive to a queue according to a Poisson process with rate 2ρ, where ρ ∈ (0, 1). The item sizes are independent and identically distributed (i.i.d.) with a uniform distribution in [0, 1]. At each time unit, a single unit-size bin is availa...

متن کامل

Queues with deterministic reneging times

We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation is developed using the level crossing analysis for the M/G/1 queue with reneging. An analytical solution is given for the M/HyperExponential/1 queue with deterministic reneging times and a numerical approach is present...

متن کامل

Queues with Nonexponential Failure Times

There are two difficulties with the inclusion of nonexponential failure times in queueing models. The first effect is that the failures will change the mean and variance (as well as higher moments) of the effective service times. The second difficulty is less obvious in that nonexponential failures will eliminate the stochastic independence between successive service times. Using phase-type dis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review

سال: 2015

ISSN: 0163-5999

DOI: 10.1145/2825236.2825258